package com.lfg.leetcode.leetcode100;

import com.lfg.leetcode.leetcode0.TreeNode;

import java.util.ArrayList;
import java.util.List;

public class No198rob {

    public static void main(String[] args) {
        Integer ret = rob(new int[]{1,2,3,1});
        System.out.println(ret);
    }


    public static int rob(int[] nums) {
        if(nums.length == 0){
            return 0;
        }
        if(nums.length == 1){
            return nums[0];
        }
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for(int i=2;i<nums.length;i++){
            dp[i] = Math.max((nums[i] + dp[i-2]), dp[i-1]);
        }
        return  dp[nums.length-1];
    }
}
